Sign non‐reversal property for totally non‐negative and totally positive matrices, and testing total positivity of their interval hull

نویسندگان

چکیده

A matrix $A$ is totally positive (or non-negative) of order $k$, denoted $TP_k$ $TN_k$), if all minors size $\leq k$ are non-negative). It well-known that such matrices characterized by the variation diminishing property together with sign non-reversal property. We do away former, and show only every submatrix formed from at most $k$ consecutive rows columns has In fact this can be strengthened to consider test vectors in $\mathbb{R}^k$ alternating signs. also a similar characterization for $TN_k$ - more strongly, both these characterizations use single vector (with signs) each square submatrix. These novel, spirit fundamental results characterizing $TP$ Gantmacher-Krein [Compos. Math. 1937] $P$-matrices Gale-Nikaido [Math. Ann. 1965]. As an application, we study interval hull $\mathbb{I}(A,B)$ two $m \times n$ $A=(a_{ij})$ $B = (b_{ij})$. This collection $C \in \mathbb{R}^{m n}$ $c_{ij}$ between $a_{ij}$ $b_{ij}$. Using property, identify two-element subset detects arbitrary $k \geq 1$. particular, provides total positivity (of any order), simultaneously entire class rectangular matrices. parallel, provide finite set non-negativity order) $\mathbb{I}(A,B)$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Immanants of Totally Positive Matrices Are Nonnegative

If/ is an irreducible character of Sn, these functions are known as immanants; if/ is an irreducible character of some subgroup G of Sn (extended trivially to all of Sn by defining /(vv) = 0 for w$G), these are known as generalized matrix functions. Note that the determinant and permanent are obtained by choosing / to be the sign character and trivial character of Sn, respectively. We should po...

متن کامل

Totally Nonnegative (0, 1)-Matrices

We investigate (0, 1)-matrices which are totally nonnegative and therefore which have all of their eigenvalues equal to nonnegative real numbers. Such matrices are characterized by four forbidden submatrices (of orders 2 and 3). We show that the maximum number of 0s in an irreducible (0, 1)-matrix of order n is (n − 1) and characterize those matrices with this number of 0s. We also show that th...

متن کامل

Interlacing Inequalities for Totally Nonnegative Matrices

Suppose λ1 ≥ · · · ≥ λn ≥ 0 are the eigenvalues of an n × n totally nonnegative matrix, and λ̃1 ≥ · · · ≥ λ̃k are the eigenvalues of a k × k principal submatrix. A short proof is given of the interlacing inequalities: λi ≥ λ̃i ≥ λi+n−k, i = 1, . . . , k. It is shown that if k = 1, 2, n− 2, n− 1, λi and λ̃j are nonnegative numbers satisfying the above inequalities, then there exists a totally nonneg...

متن کامل

LU decomposition of totally nonnegative matrices

A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.

متن کامل

An Interlacing Property of Eigenvalues of Strictly Totally Positive Matrices

We prove results concerning the interlacing of eigenvalues of principal submatrices of strictly totally positive matrices. §

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of The London Mathematical Society

سال: 2021

ISSN: ['1469-2120', '0024-6093']

DOI: https://doi.org/10.1112/blms.12475